ON (k, l)-KERNEL PERFECTNESS OF SPECIAL CLASSES OF DIGRAPHS
نویسندگان
چکیده
In the first part of this paper we give necessary and sufficient conditions for some special classes of digraphs to have a (k, l)-kernel. One of them is the duplication of a set of vertices in a digraph. This duplication come into being as the generalization of the duplication of a vertex in a graph (see [4]). Another one is the D-join of a digraph D and a sequence α of nonempty pairwise disjoint digraphs. In the second part we prove theorems, which give necessary and sufficient conditions for special digraphs presented in the first part to be (k, l)-kernel-perfect digraphs. The concept of a (k, l)-kernel-perfect digraph is the generalization of the well-know idea of a kernel perfect digraph, which was considered in [1] and [6].
منابع مشابه
Kernels and perfectness in arc-local tournament digraphs
In this paper we give a characterization of kernel-perfect (and of critical kernel-imperfect) arc-local tournament digraphs. As a consequence, we prove that arc-local tournament digraphs satisfy a strenghtened form of the following interesting conjecture which constitutes a bridge between kernels and perfectness in digraphs, stated by C. Berge and P. Duchet in 1982: a graph G is perfect if and ...
متن کاملOn (k, l)-kernels of special superdigraphs of Pm and Cm
The concept of (k, l)-kernels of digraphs was introduced in [2]. Next, H. Galeana-Sanchez [?] proved a sufficient condition for a digraph to have a (k, l)-kernel. The result generalizes the well-known theorem of P. Duchet and it is formulated in terms of symmetric pairs of arcs. Our aim is to give necessary and sufficient conditions for digraphs without symmetric pairs of arcs to have a (k, l)-...
متن کاملMonochromatic kernel-perfectness of special classes of digraphs
A digraph D is said to be an m-coloured digraph, if its arcs are coloured with m colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. A set N ⊆ V (D) of vertices of D is said to be a kernel by monochromatic paths of the m-coloured digraph D, if it satisfies the two following properties: (1) N is independent by monochromatic paths; i.e., f...
متن کاملOn the complexity of the 3-kernel problem in some classes of digraphs
Let D be a digraph with the vertex set V (D) and the arc set A(D). A subset N of V (D) is k-independent if for every pair of vertices u, v ∈ N , we have d(u, v), d(v, u) ≥ k; it is l-absorbent if for every u ∈ V (D) − N there exists v ∈ N such that d(u, v) ≤ l. A k-kernel of D is a k-independent and (k − 1)-absorbent subset of V (D). A 2-kernel is called a kernel. It is known that the problem o...
متن کاملK-kernels in K-transitive and K-quasi-transitive Digraphs
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent (if u, v ∈ N then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l) set of vertices. A k-kernel is a (k, k − 1)-kernel. A digraph D is transitive if (u, v), (v, w) ∈ A(D) implies that (u,w) ∈ A(D). This co...
متن کامل